Fail-Stop Failure Algorithm-Based Fault Tolerance for Cholesky Decomposition
نویسندگان
چکیده
منابع مشابه
Fail-Stutter Fault Tolerance
Traditional fault models present system designers with two extremes: the Byzantine fault model, which is general and therefore difficult to apply, and the fail-stop fault model, which is easier to employ but does not accurately capture modern device behavior. To address this gap, we introduce the concept of fail-stutter fault tolerance, a realistic and yet tractable fault model that accounts fo...
متن کاملAlgorithm-Based Fault Tolerance for FFT Networks
Call packing has been recognized as a routing scheme thatsignificantly reduces the blocking probability of connection requests ina circuit-switched Clos multistage interconnection network. In this briefcontribution, for the first time, we develop general analytical models forthe point-to-point blocking probability of the call-packing scheme appliedto Clos networks. By introd...
متن کاملFault and Failure Tolerance
Jack D. Cowan SFI WORKING PAPER: 1995-10-096 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on...
متن کاملFactorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even if an adversary breaks the scheme’s underlying computational hard problem and hence forges a signature, then with overwhelming probability the signer is able to prove that a forgery has occurred (i.e. that the underlyi...
متن کاملEntropy-Based Incomplete Cholesky Decomposition for a Scalable Spectral Clustering Algorithm: Computational Studies and Sensitivity Analysis
Rocco Langone 1,*, Marc Van Barel 2 and Johan A. K. Suykens 1 1 ESAT-STADIUS, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001 Leuven, Belgium; [email protected] 2 Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B-3001 Leuven, Belgium; [email protected] * Correspondence: [email protected]; Tel.: +32-16-32-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2015
ISSN: 1045-9219
DOI: 10.1109/tpds.2014.2320502